Topological Sweep in Degenerate Cases
نویسندگان
چکیده
Topological sweep can contribute to efficient implementations of various algorithms for data analysis. Real data, however, has degeneracies. The modification of the topological sweep algorithm presented here handles degenerate cases such as parallel or multiply concurrent lines without requiring numerical perturbations to achieve general position. Our method maintains the O(n) and O(n) time and space complexities of the original algorithm, and is robust and easy to implement. We present experimental results.
منابع مشابه
2D Arrangements -
Constructs, maintains, modifies, traverses, queries, and presents arrangements on two-dimensional parametric surfaces. Complete and Robust All inputs are handled correctly (including degenerate input). Exact number types are used to achieve robustness. Generic – easy to interface, extend, and adapt Modular – geometric and topological aspects are separated Supports among the others: various poin...
متن کاملTopological states in a one-dimensional fermi gas with attractive interaction.
We describe a novel topological superfluid state, which forms in a one-dimensional Fermi gas with Rashba-like spin-orbit coupling, a Zeeman field, and intrinsic attractive interactions. In spite of total number conservation and the presence of gapless excitations, Majorana-like zero modes appear in this system and can be linked with interfaces between two distinct phases that naturally form at ...
متن کاملSweeping Arrangements of Cubic Segments Exactly and Efficiently
A method is presented to compute the planar arrangement induced by segments of algebraic curves of degree three (or less), using an improved Bentley-Ottmann sweep-line algorithm. Our method is exact (it provides the mathematically correct result), complete (it handles all possible geometric degeneracies), and efficient (the implementation can handle hundreds of segments). The range of possible ...
متن کاملParallel computing 2D Voronoi diagrams using untransformed sweepcircles
Voronoi diagrams are among the most important data structures in geometric modeling. Among many efficient algorithms for computing 2D Voronoi diagrams, Fortune’s sweepline algorithm (Fortune, 1986 [5]) is popular due to its elegance and simplicity. Dehne and Klein (1987) [8] extended sweepline to sweepcircle and suggested computing a type of transformed Voronoi diagram, which is parallel in nat...
متن کاملConductivity Coefficient Modeling in Degenerate and Non-Degenerate Modes on GNSs
Carbon nanoscrolls (CNSs) with tubular structure similar to the open multiwall carbonnanotube have been of hot debate during recent years. Due to its unique property, Graphene Nanoscroll (GNS) have attracted many research groups’ attention and have been used by them. They specially studied on energy storage devices such as batteries and super capacitors. These devices can be schematically...
متن کامل